An Account of Congruences Mod pk Using Halley’s Method
نویسندگان
چکیده
In this paper we find solutions of congruences of the form ax ≡ b(mod p), k≥1 where a, b and n>0 are integers which are not divisible by a prime p using Halley's iterative algorithm. An algorithm is also proposed to reduce the degree of a nonlinear congruence modulo p. AMS Mathematics Subject Classification (2000): 05C25 • 11E04 • 20G15
منابع مشابه
Some Arithmetic Properties of Overpartition K -tuples
Abstract Recently, Lovejoy introduced the construct of overpartition pairs which are a natural generalization of overpartitions. Here we generalize that idea to overpartition ktuples and prove several congruences related to them. We denote the number of overpartition k-tuples of a positive integer n by pk(n) and prove, for example, that for all n ≥ 0, pt−1(tn + r) ≡ 0 (mod t) where t is prime a...
متن کاملCongruences modulo Prime Powers
Let p be any prime, and let α and n be nonnegative integers. Let r ∈ Z and f (x) ∈ Z[x]. We establish the congruence p deg f k≡r (mod p α) n k (−1) k f k − r p α ≡ 0 mod p ∞ i=α ⌊n/p i ⌋ (motivated by a conjecture arising from algebraic topology), and obtain the following vast generalization of Lucas' theorem: If α > 1 and l, s, t are nonnegative integers with s, t < p, then 1 ⌊n/p α−1 ⌋! k≡r (...
متن کاملRamanujan’s Elementary Method in Partition Congruences
Page 182 in Ramanujan’s lost notebook corresponds to page 5 of an otherwise lost manuscript of Ramanujan closely related to his paper providing elementary proofs of his partition congruences p(5n + 4) ≡ 0 (mod 5) and p(7n+ 5) ≡ 0 (mod 7). The claims on page 182 are proved and discussed, and further results depending on Ramanujan’s ideas are established.
متن کاملCombinatorial Congruences modulo Prime Powers
Let p be any prime, and let α and n be nonnegative integers. Let r ∈ Z and f(x) ∈ Z[x]. We establish the congruence p f ∑ k≡r (mod pα) (n k ) (−1)f ( k − r pα ) ≡ 0 ( mod p ∑∞ i=α n/p i ) (motivated by a conjecture arising from algebraic topology) and obtain the following vast generalization of Lucas’ theorem: If α is greater than one, and l, s, t are nonnegative integers with s, t < p, then 1 ...
متن کاملCongruences for Andrews’ Smallest Parts Partition Function and New Congruences for Dyson’s Rank
Let spt(n) denote the total number of appearances of smallest parts in the partitions of n. Recently, Andrews showed how spt(n) is related to the second rank moment, and proved some surprising Ramanujan-type congruences mod 5, 7 and 13. We prove a generalization of these congruences using known relations between rank and crank moments. We obtain an explicit Ramanujan-type congruence for spt(n) ...
متن کامل